0.08/0.14	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.15	% Command    : run_E %s %d THM
0.15/0.36	% Computer : n022.cluster.edu
0.15/0.36	% Model    : x86_64 x86_64
0.15/0.36	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.36	% Memory   : 8042.1875MB
0.15/0.36	% OS       : Linux 3.10.0-693.el7.x86_64
0.15/0.36	% CPULimit   : 960
0.15/0.36	% WCLimit    : 120
0.15/0.36	% DateTime   : Tue Aug  9 06:26:01 EDT 2022
0.15/0.36	% CPUTime    : 
0.23/0.51	Running higher-order on 8 cores theorem proving
0.23/0.51	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.23/0.51	# Version: 3.0pre003-ho
0.23/0.52	# Preprocessing class: HSSSSMSSSSSNHHA.
0.23/0.52	# Scheduled 5 strats onto 8 cores with 120 seconds (960 total)
0.23/0.52	# Starting sh2lt with 480s (4) cores
0.23/0.52	# Starting new_ho_10_unif with 120s (1) cores
0.23/0.52	# Starting full_lambda_6 with 120s (1) cores
0.23/0.52	# Starting post_as_ho1 with 120s (1) cores
0.23/0.52	# Starting ehoh_best3_rw with 120s (1) cores
0.23/0.52	# new_ho_10_unif with pid 5692 completed with status 0
0.23/0.52	# Result found by new_ho_10_unif
0.23/0.52	# Preprocessing class: HSSSSMSSSSSNHHA.
0.23/0.52	# Scheduled 5 strats onto 8 cores with 120 seconds (960 total)
0.23/0.52	# Starting sh2lt with 480s (4) cores
0.23/0.52	# Starting new_ho_10_unif with 120s (1) cores
0.23/0.52	# No SInE strategy applied
0.23/0.52	# Search class: HUUPF-FFSF00-SHHFFMNN
0.23/0.52	# partial match(2): HUHPF-FFSF00-SHHFFFNN
0.23/0.52	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.23/0.52	# Starting new_ho_10 with 65s (1) cores
0.23/0.52	# new_ho_10 with pid 5698 completed with status 9
0.23/0.52	# Starting new_ho_10_unif with 13s (1) cores
0.23/0.52	# new_ho_10_unif with pid 5705 completed with status 0
0.23/0.52	# Result found by new_ho_10_unif
0.23/0.52	# Preprocessing class: HSSSSMSSSSSNHHA.
0.23/0.52	# Scheduled 5 strats onto 8 cores with 120 seconds (960 total)
0.23/0.52	# Starting sh2lt with 480s (4) cores
0.23/0.52	# Starting new_ho_10_unif with 120s (1) cores
0.23/0.52	# No SInE strategy applied
0.23/0.52	# Search class: HUUPF-FFSF00-SHHFFMNN
0.23/0.52	# partial match(2): HUHPF-FFSF00-SHHFFFNN
0.23/0.52	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.23/0.52	# Starting new_ho_10 with 65s (1) cores
0.23/0.52	# new_ho_10 with pid 5698 completed with status 9
0.23/0.52	# Starting new_ho_10_unif with 13s (1) cores
0.23/0.52	# Preprocessing time       : 0.001 s
0.23/0.52	# Presaturation interreduction done
0.23/0.52	
0.23/0.52	# Proof found!
0.23/0.52	# SZS status Theorem
0.23/0.52	# SZS output start CNFRefutation
0.23/0.52	thf(decl_22, type, cV: $i).
0.23/0.52	thf(decl_23, type, cU: $i).
0.23/0.52	thf(decl_24, type, esk1_0: $i > $i).
0.23/0.52	thf(cTHM24_pme, conjecture, (?[X1:($i > $i) > ($i > $i) > $i > $i]:(~(![X2:$i > $i, X3:$i > $i]:(((X1 @ X2 @ X3)=(X1 @ X3 @ X2)))))<=((cU)!=(cV))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cTHM24_pme)).
0.23/0.52	thf(c_0_1, negated_conjecture, ~((((cU)!=(cV))=>?[X1:($i > $i) > ($i > $i) > $i > $i]:(~(![X2:$i > $i, X3:$i > $i]:(((X1 @ X2 @ X3)=(X1 @ X3 @ X2))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM24_pme])])).
0.23/0.52	thf(c_0_2, negated_conjecture, ![X7:($i > $i) > ($i > $i) > $i > $i, X8:$i > $i, X9:$i > $i]:((((cU)!=(cV))&((X7 @ X8 @ X9)=(X7 @ X9 @ X8)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])).
0.23/0.52	thf(c_0_3, negated_conjecture, ![X1:($i > $i) > ($i > $i) > $i > $i, X3:$i > $i, X2:$i > $i]:(((X1 @ X2 @ X3)=(X1 @ X3 @ X2))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.23/0.52	thf(c_0_4, negated_conjecture, ((cU)!=(cV)), inference(split_conjunct,[status(thm)],[c_0_2])).
0.23/0.52	thf(c_0_5, negated_conjecture, ![X1:($i > $i) > ($i > $i) > $i > $i, X2:$i > $i, X3:$i > $i, X10:$i]:(((X1 @ X2 @ X3 @ X10)=(X1 @ X3 @ X2 @ X10))), inference(arg_cong,[status(thm)],[c_0_3])).
0.23/0.52	thf(c_0_6, negated_conjecture, ![X2:$i > $i]:(((X2 @ cV)!=(cU))), inference(spm,[status(thm)],[c_0_4, c_0_5])).
0.23/0.52	thf(c_0_7, negated_conjecture, ($false), inference(er,[status(thm)],[c_0_6]), ['proof']).
0.23/0.52	# SZS output end CNFRefutation
0.23/0.52	# Parsed axioms                        : 3
0.23/0.52	# Removed by relevancy pruning/SinE    : 0
0.23/0.52	# Initial clauses                      : 4
0.23/0.52	# Removed in clause preprocessing      : 2
0.23/0.52	# Initial clauses in saturation        : 2
0.23/0.52	# Processed clauses                    : 12
0.23/0.52	# ...of these trivial                  : 0
0.23/0.52	# ...subsumed                          : 4
0.23/0.52	# ...remaining for further processing  : 8
0.23/0.52	# Other redundant clauses eliminated   : 0
0.23/0.52	# Clauses deleted for lack of memory   : 0
0.23/0.52	# Backward-subsumed                    : 1
0.23/0.52	# Backward-rewritten                   : 0
0.23/0.52	# Generated clauses                    : 144
0.23/0.52	# ...of the previous two non-redundant : 95
0.23/0.52	# ...aggressively subsumed             : 0
0.23/0.52	# Contextual simplify-reflections      : 0
0.23/0.52	# Paramodulations                      : 140
0.23/0.52	# Factorizations                       : 0
0.23/0.52	# NegExts                              : 0
0.23/0.52	# Equation resolutions                 : 1
0.23/0.52	# Propositional unsat checks           : 0
0.23/0.52	#    Propositional check models        : 0
0.23/0.52	#    Propositional check unsatisfiable : 0
0.23/0.52	#    Propositional clauses             : 0
0.23/0.52	#    Propositional clauses after purity: 0
0.23/0.52	#    Propositional unsat core size     : 0
0.23/0.52	#    Propositional preprocessing time  : 0.000
0.23/0.52	#    Propositional encoding time       : 0.000
0.23/0.52	#    Propositional solver time         : 0.000
0.23/0.52	#    Success case prop preproc time    : 0.000
0.23/0.52	#    Success case prop encoding time   : 0.000
0.23/0.52	#    Success case prop solver time     : 0.000
0.23/0.52	# Current number of processed clauses  : 5
0.23/0.52	#    Positive orientable unit clauses  : 0
0.23/0.52	#    Positive unorientable unit clauses: 3
0.23/0.52	#    Negative unit clauses             : 2
0.23/0.52	#    Non-unit-clauses                  : 0
0.23/0.52	# Current number of unprocessed clauses: 87
0.23/0.52	# ...number of literals in the above   : 87
0.23/0.52	# Current number of archived formulas  : 0
0.23/0.52	# Current number of archived clauses   : 3
0.23/0.52	# Clause-clause subsumption calls (NU) : 0
0.23/0.52	# Rec. Clause-clause subsumption calls : 0
0.23/0.52	# Non-unit clause-clause subsumptions  : 0
0.23/0.52	# Unit Clause-clause subsumption calls : 5
0.23/0.52	# Rewrite failures with RHS unbound    : 0
0.23/0.52	# BW rewrite match attempts            : 36
0.23/0.52	# BW rewrite match successes           : 6
0.23/0.52	# Condensation attempts                : 12
0.23/0.52	# Condensation successes               : 0
0.23/0.52	# Termbank termtop insertions          : 3831
0.23/0.52	
0.23/0.52	# -------------------------------------------------
0.23/0.52	# User time                : 0.007 s
0.23/0.52	# System time              : 0.003 s
0.23/0.52	# Total time               : 0.009 s
0.23/0.52	# Maximum resident set size: 1628 pages
0.23/0.52	
0.23/0.52	# -------------------------------------------------
0.23/0.52	# User time                : 0.008 s
0.23/0.52	# System time              : 0.004 s
0.23/0.52	# Total time               : 0.012 s
0.23/0.52	# Maximum resident set size: 1720 pages
0.23/0.52	EOF